A matheuristic for the Team Orienteering Arc Routing Problem

A matheuristic for the Team Orienteering Arc Routing Problem

In the Team Orienteering Arc Routing Problem (TOARP) the potential customers are located on the arcs of a graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for...

The Team Orienteering Arc Routing Problem

The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem (TOP). In the TOARP a set of potential customers, each associated with an arc of a directed graph, is available and a profit is collected when a potential customer is served that is when the associated arc is traversed. A fleet of vehicles is available to visit the cust...

Metaheuristics for the team orienteering problem

A branch-and-cut algorithm for the Orienteering Arc Routing Problem

In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP), in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing t...

A matheuristic for the truck and trailer routing problem

3 COPA, Department of Industrial Engineering, Universidad de los Andes, Bogota, Colombia {amedagli, nvelasco}@uniandes.edu.co In the truck and trailer problem (TTRP), raised for instance by milk collection in rural areas, a heterogeneous fleet composed of mt trucks and mr trailers (mr < mt) serves a set of customers N = {1, 2, ..., n} from a main depot, denoted as node 0. Each customer i ∈N h...